CMSC 858 F : Algorithmic Game Theory Fall 2010 Complexity of finding Nash equilibrium : PPAD completeness results
نویسندگان
چکیده
Nash’s theorem guarantees the presence of mixed nash equilibrium in every finite game. We are concerned here with the problem of finding such an equilibrium efficiently. In other words, does there exist an algorithm to find the mixed nash equilibrium in polynomial time? The answer to this question is not known but it is known finding mixed Nash equilibrium is PPAD complete, which implies some sort of hardness.
منابع مشابه
CMSC 858F: Algorithmic Lower Bounds Fall 2014 Introduction to Algorithmic Game Theory
structure. A directed graph is defined over the vertices of the polytope where all strategies are easily recognizable and represented. Each one of these vertices has in-degree at most 1 and out-degree at most 1. Hence the graph is a collection of paths and cycles. By necessity, there is one vertex with no in-coming edge and one out-going edge such a vertex is called the standard source. By the ...
متن کاملCMSC 858 F : Algorithmic Game Theory Spring 2014
The problem of finding Nash equilibria is one of the fundamental problems in Algorithmic Game Theory, and has made a nice connection between Game Theory and Computer Science [9]. While Nash [10] introduced the concept of Nash equilibrium and proved every game has a mixed Nash equilibrium, finding a Nash equilibrium in reasonable time seems to be essential. The Nash equilibrium can be used as a ...
متن کاملCS364A: Algorithmic Game Theory Lecture #20: Mixed Nash Equilibria and PPAD-Completeness∗
Today we continue our study of the limitations of learning dynamics and polynomial-time algorithms for converging to and computing equilibria. Recall that we have sweeping positive results for coarse correlated and correlated equilibria, which are tractable in arbitrary games. We have only partial positive results for pure Nash equilibria of routing and congestion games, and last lecture we dev...
متن کاملCMSC 858 F : Algorithmic Game Theory Fall 2010 Market Clearing with Applications
We will look at MARKET CLEARING or MARKET EQUILIBRIUM prices. We will consider two models with linear utilities : FISHER model and ARROWDEBREU model. See [1] and chapter 5 of [2] for more details. Finally we see an application of the FISHER model to wireless networks. I have also used as reference the scribe notes for this same lecture when this course was taught by Prof. Hajiaghayi at Rutgers ...
متن کاملCMSC 858 F : Algorithmic Game Theory Fall 2010
In game theory as we have studied it so far this semester, games are assumed to be interactions between completely independent and selfish parties. For example, Nash equilibria were assumed to be stable, since no single player could alter their strategy and benefit. However, there could, for example, be a situation where there are two Nash equilibria. In the current equilibrium state, no player...
متن کامل